The random exploration graph for optimal exploration of unknown environments
نویسندگان
چکیده
منابع مشابه
Exploration of Unknown or Partially Known Environments ?
This paper describes our present results in the generation of a local 3D environmental model primarily based on the line-based stereo-vision and its planned extension to other sensor systems. It describes the way the explored data is processed to reconstruct the environmental description and to support the sensor data processing. We present the way the sensor data is obtained, stored and modiie...
متن کاملSupervised Multi-Agent Exploration Of Unknown Environments
Exploration is a central issue for autonomous agents which must carry out navigation tasks in environments whose detailed description is not known a priori. In our approach the environment is described, from a symbolic point of view, by means of a graph; clustering techniques allow for further levels of abstraction to be defined, leading to a multilayered representation. In this work we propose...
متن کاملRobot Swarms for Exploration and Triangulation of Unknown Environments
We consider a robot swarm in an unknown polygon. All robots have only a limited communication range. We then look for a triangulation of the polygon using the robots as vertices such that the number of robots used for the triangulation is minimized. All edges in the triangulation have a length smaller than the communication range. For this Online Minimum Relay Triangulation Problem, we present ...
متن کاملAdapting Control Methods for Autonomous Exploration of Unknown Environments
On the other hand, developing and testing Proposed missions to explore comets and moons will encounter environments that are hostile and unpredictable. Any successful explorer must be able to adapt to a wide range of possible operating conditions in order to survive. The traditional approach of constructing special-purpose control methods would require a information about the environment, which...
متن کاملPredicting the labels of an unknown graph via adaptive exploration
Motivated by a problem of targeted advertising in social networks, we introduce a new model of online learning on labeled graphs where the graph is initially unknown and the algorithm is free to choose which vertex to predict next. For this learning model, we define an appropriate measure of regularity of a graph labeling called the merging degree. In general, the merging degree is small when t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Robotic Systems
سال: 2017
ISSN: 1729-8814,1729-8814
DOI: 10.1177/1729881416687110